Uncertainty and computational complexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity

In many application areas, it is important to detect outliers. The traditional engineering approach to outlier detection is that we start with some “normal” values x1, . . . , xn, compute the sample average E, the sample standard variation σ, and then mark a value x as an outlier if x is outside the k0-sigma interval [E − k0 · σ, E + k0 · σ] (for some pre-selected parameter k0). In real life, w...

متن کامل

Statistical Data Processing under Interval Uncertainty: Algorithms and Computational Complexity

Why indirect measurements? In many real-life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. Examples of such quantities are the distance to a star and the amount of oil in a given well. Since we cannot measure y directly, a natural idea is to measure y indirectly. Specifically, we find some easier-to-measure quantities x1...

متن کامل

Estimating information amount under uncertainty: algorithmic solvability and computational complexity

Sometimes, we know the probability of different values of the estimation error ∆x def = e x− x, sometimes, we only know the interval of possible values of ∆x, sometimes, we have interval bounds on the cdf of ∆x. To compare different measuring instruments, it is desirable to know which of them brings more information – i.e., it is desirable to gauge the amount of information. For probabilistic u...

متن کامل

Computational Complexity and Knowledge Complexity

We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in BPPNP . Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known. In the course of our proof, we relate statistical knowledge complexity to perfect k...

متن کامل

Uncertainty, Difficulty, and Complexity

In this paper, I formally deene uncertainty, diiculty, and complexity both as measures of problems and environments and as analytic paradigms and discuss the importance of the diiculty and uncertainty paradigms in the study of institutions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Philosophical Transactions of the Royal Society B: Biological Sciences

سال: 2018

ISSN: 0962-8436,1471-2970

DOI: 10.1098/rstb.2018.0138